Powerful City Networks: More than Connections, Less than Domination and Control
نویسندگان
چکیده
منابع مشابه
Turbulence in more than two and less than three dimensions.
We investigate the behavior of turbulent systems in geometries with one compactified dimension. A novel phenomenological scenario dominated by the splitting of the turbulent cascade emerges both from the theoretical analysis of passive scalar turbulence and from direct numerical simulations of Navier-Stokes turbulence.
متن کاملTerritorial Foresight: More than Planning Less than Prospective
After the Y2K crisis many futurists feared that it might take another millennium to receive the same attention the year 2000 brought to us. Fortunately, we have seen that part of the interest in the future that the turning of century and millennium provoked seems to carry on. One of the most remarkable features of this continued appeal is regional foresight, or should I say regional planning? T...
متن کاملSaying More (or Less) than One Thing
In a paper called Definiteness and Knowability, Timothy Williamson investigates the question of whether one must accept that vagueness is an epistemic phenomenon if one adopts classical logic and a disquotational principle for truth. Some have thought that one must not, and have argued that classical logic and the disquotational principle can be preserved without accepting that vagueness is an ...
متن کاملAdaptation as a more powerful tool than decomposition and integration
Recently a new way of building control systems, known as behavior based robotics, has been proposed to overcome the difficulties of the traditional AI approach to robotics. Most of the work done in behavior-based robotics involves a decomposition process (in which the behavior required is broken down into simpler sub-components) and in an integration approach (in which the modules designed to p...
متن کاملMonotone switching networks for directed connectivity are strictly more powerful than certain-knowledge switching networks
L (Logarithmic space) versus NL (Non-deterministic logarithmic space) is one of the great open problems in computational complexity theory. In the paper “Bounds on monotone switching networks for directed connectivity”, we separated monotone analogues of L and NL using a model called the switching network model. In particular, by considering inputs consisting of just a path and isolated vertice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Urban Studies
سال: 2010
ISSN: 0042-0980,1360-063X
DOI: 10.1177/0042098010377364